Let's calculate some CSI
Let me illustrate that with an example. Here is a sequence of 60 bits:
1100100100 0011111101 1010101000 1000100001 0110100011 0000100011. Can you tell me whether this information is complex and specified?
I think this is great and would like to one step further and invite anyone to submit a sample so that an ID expert can calculate the CSI. What better way to clarify exactly what CSI means and establish to what extent it is objective?
I will add another example to the one posed by Oleg. I recognise that its really difficult to calculate CSI for biological entities so let's take something extremely straightforward and much used in the literature. What is the CSI of a hand of 13 cards which is all the spades in single deal of Contract Bridge? I am assuming that we are using the definition of CSI in this paper which WAD recently confirmed was the definitive account.
The full formula is on page 21: –log2[M·N· ϕS(T)·P(TH)].
However I would be content to see the calculation of just the specification component on page: 18.
σ = –log2[ ϕS(T)·P(TH)].
Or even just ϕS(T) which is defined on page 17 as:
the number of patterns for which S’s semiotic description of them is at least as simple as S’s semiotic description of T.
Thanks in advance to anyone willing to give it a go.